State dependent choice

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

State dependent choice

We propose a theory of choices that are influenced by the psychological state of the agent. The central hypothesis is that the psychological state controls the urgency of the attributes sought by the decision maker in the available alternatives. While state dependent choice is less restricted than rational choice, our model does have empirical content, expressed by simple ‘revealed preference’ ...

متن کامل

State-dependent choice and ecological rationality.

Decision makers who minimize costly errors should flexibly adjust the way they trade off competing demands, depending on their current state. We explore how state (amount of hoarded food) affects willingness to take extra predation risk to obtain larger food rewards, particularly in animals that may overemphasize safety. Assuming a sigmoid fitness function, we explore how a supplement in state ...

متن کامل

State-dependent learned valuation drives choice in an invertebrate.

Humans and other vertebrates occasionally show a preference for items remembered to be costly or experienced when the subject was in a poor condition (this is known as a sunk-costs fallacy or state-dependent valuation). Whether these mechanisms shared across vertebrates are the result of convergence toward an adaptive solution or evolutionary relicts reflecting common ancestral traits is unknow...

متن کامل

6 - Dependent Random Choice

If F is a family of graphs containing a bipartite graph, then for some δ > 0, ex(n,F) < n2−δ by the Kövari-Sós-Turán Theorem. Erdős and Simonovits [5] conjectured that for every finite family graph F of graphs, there exists α = α(F) such that ex(n,F) = Θ(nα). This α is called the exponent of F . If F is a bipartite graph containing a cycle, then in general it is not known if F = {F} has an expo...

متن کامل

Dependent random choice

We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently this technique has had several striking applications to Extremal Graph Theory, Ramsey Theory, Additive Combinatorics, and Combinatorial Geometry. In this survey we discuss so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Social Choice and Welfare

سال: 2015

ISSN: 0176-1714,1432-217X

DOI: 10.1007/s00355-015-0894-3